Another characterization of Haar subspaces
نویسندگان
چکیده
منابع مشابه
Block bases of the Haar system as complemented subspaces of . . .
It is shown that the span of fa i h i b i e i g n i=1 , where fh i g is the Haar system in L p and fe i g the canonical basis of`p , is well isomorphic to a well complemented subspace of L p ; 2 < p < 1. As a consequence we get that there is a rearrangement of the (initial segments of the) Haar system in L p ; 2 < p < 1, any block basis of which is well isomorphic to a well complemented subspac...
متن کاملOf Another Characterization Of
Stepr¯ ans provided a characterization of βN \ N in the ℵ 2-Cohen model that is much in the spirit of Parovičenko's characterization of this space under CH. A variety of the topological results established in the Cohen model can be deduced directly from the properties of βN \ N or P(N)/fin that feature in Stepr¯ ans' result.
متن کاملAnother Characterization of Trees
It is proved that a continuum is a tree if and only if each two connected subsets meet in a connected set. In this note a continuum is a compact connected Hausdorff space. A tree is a continuum in which distinct points are never conjugate [6], i.e., any two distinct points are separated by the deletion of some third point. A dendrite is a metrizable tree. The literature is replete with characte...
متن کاملAnother Characterization of Parabolic Subgroups
Let G be a reductive algebraic group defined over an algebraically closed field k. Let H be a closed connected subgroup of G containing a maximal torus T of G. In [13] it was shown (at least in characteristic zero) that the parabolic subgroups of G can be characterized among all such subgroups H by a certain finiteness property of the induction functor (-)Iz and its derived functors Lk,G(-). Th...
متن کاملAnother characterization of weakest preconditions
We present an approach to the study of nondeterministic programs, consisting essentially in using binary relations as semantic objects representing the input-output behaviour of programs. These relations include an explicit representation of non-terminating computations. Based on the relational model we introduce a weakest precondition total correctness predicate transformer. We then show how t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1975
ISSN: 0021-9045
DOI: 10.1016/0021-9045(75)90081-7